Solving scheduling problems using Petri nets and constraint logic programming
نویسندگان
چکیده
منابع مشابه
Logic Programming Petri Nets
With the purpose of modeling, specifying and reasoning in an integrated fashion with procedural and declarative aspects (both commonly present in cases or scenarios), the paper introduces Logic Programming Petri Nets (LPPN), an extension to the Petri Net notation providing an interface to logic programming constructs. Two semantics are presented. First, a hybrid operational semantics that separ...
متن کاملOn temporal logic programming using Petri nets
A methodology for modeling temporal (timesensitive) aspects of discrete-event systems is presented. A formalism of temporal logic which incorporates both point and interval descriptions of time is formulated, which is an extension of Allen’s interval logic [1]. A formal axiomatic system of this point-interval logic is presented. A graph model is shown to implement the axiomatic system of point-...
متن کاملSolving Embedded System Scheduling Problems using Constraint Programming
Static scheduling of tasks in embedded distributed real-time systems often implies a tediuos iterative design process. The reason for this is the lack of exibility and expressive power in existing scheduling frameworks, which makes it di cult to both model the system accurately and provide correct optimization guidelines in a rst attempt. The most detrimental e ect this has on the scheduling pr...
متن کاملSolving Scheduling Problems as the Puzzle Games Using Constraint Programming
Constraint programming (CP) is one of the most effective techniques for solving practical operational problems. The outstanding feature of the method is a set of constraints affecting a solution of a problem can be imposed without a need to explicitly defining a linear relation among variables, i.e. an equation. Nevertheless, the challenge of paramount importance in using this technique is how ...
متن کاملSolving scheduling problems using parallel message-passing based constraint programming
We discuss some of the engineering challenges in implementing a constraint programming based scheduling engine to scale well on massively parallel computer hardware. In particular, we have been targeting our solvers to work in high performance computer environments such as the IBM BlueGene/P supercomputer. On such hardware parallelism is enabled at the software level using message passing, base...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 1998
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro/1998320201251